Uniqueness and strong uniqueness of best approximations by spline subspaces and other subspaces
نویسندگان
چکیده
منابع مشابه
Uniqueness of linear factorizations into independent subspaces
Given a random vector X, we address the question of linear separability of X, that is, the task of finding a linear operator W such that we have (S1, . . . ,SM ) = (WX) with statistically independent random vectors Si. As this requirement alone is already fulfilled trivially by X being independent of the empty rest, we require that the components be not further decomposable. We show that if X h...
متن کاملExistence, Uniqueness, and Parametrization of Lagrangian Invariant Subspaces
The existence, uniqueness, and parametrization of Lagrangian invariant subspaces for Hamiltonian matrices is studied. Necessary and sufficient conditions and a complete parametrization are given. Some necessary and sufficient conditions for the existence of Hermitian solutions of algebraic Riccati equations follow as simple corollaries.
متن کاملUNIQUENESS OF BEST PARAMETRIC INTERPOLATION BY CUBIC SPLINE CURVES by
Best parametric spline interpolation extends and refines the classical spline problem of best interpolation to (∗) inf t inf f { ∫ 1 0 ‖f (t)‖dt : f(ti) = yi, 1 ≤ i ≤ n} Here t : 0 = t1 < . . . < tn = 1 denotes a sequence of nodes and yi data in R d with y i 6= y i+1 . The R valued functionsf(t) lie componentwise in the Sobolev space L2(0, 1) and ‖ ‖ denotes the Euclidean norm in R. This proble...
متن کاملUniqueness of Minimal Projections onto Two-dimensional Subspaces
In this paper we prove that the minimal projections from Lp (1 < p < ∞) onto any two-dimensional subspace is unique. This result complements the theorems of W. Odyniec ([OL, Theorem I.1.3], [O3]) We also investigate the minimal number of norming points for such projections.
متن کاملCovering of subspaces by subspaces
Lower and upper bounds on the size of a covering of subspaces in the Grassmann graph Gq(n, r) by subspaces from the Grassmann graph Gq(n, k), k ≥ r , are discussed. The problem is of interest from four points of view: coding theory, combinatorial designs, q-analogs, and projective geometry. In particular we examine coverings based on lifted maximum rank distance codes, combined with spreads and...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Mathematical Analysis and Applications
سال: 1982
ISSN: 0022-247X
DOI: 10.1016/0022-247x(82)90051-8